Bounded Model Checking for Asynchronous Hyperproperties

Abstract Many types of attacks on confidentiality stem from the nondeterministic nature environment that computer programs operate in. We focus verification in environments by reasoning about asynchronous hyperproperties . generalize temporal logic to allow nested trajectory quantification, where a determines how different execution traces may advance and stutter. propose bounded model checking algorithm for based QBF-solving fragment evaluate it various case studies concurrent programs, scheduling attacks, compiler optimization, speculative execution, cache timing attacks. also rigorously analyze complexity